________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 11:53:15
Input Data from:  dataset163.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :300
# of Locations  :20
Ex.Facilities   :2
Total budget    :25000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,0616666666666667
Average f[i]   :4450
Average g[i,j] :1977,77777777778
Total demand   :16720
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 19
> Selected Move:	1490	1	-1	11	4500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0    >new incumb.: 1490


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 69
> Selected Move:	2710	1	-1	15	10500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0    >new incumb.: 2710


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 78
> Selected Move:	3870	1	-1	12	15500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  1  1  0  0  1  0  0  0  0    >new incumb.: 3870


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 95
> Selected Move:	4790	1	-1	19	20000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  1  1  0  0  1  0  0  0  1    >new incumb.: 4790


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 107
> Selected Move:	5660	1	-1	17	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  1  1  0  0  1  0  1  0  1    >new incumb.: 5660


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 109
> Selected Move:	5600	3	19	10	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  1  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 96
> Selected Move:	5530	3	10	6	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  1  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 97
> Selected Move:	5580	3	17	19	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  1  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 95
> Selected Move:	5560	3	6	8	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 107
> Selected Move:	5510	3	19	17	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 107
> Selected Move:	5500	3	17	10	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 95
> Selected Move:	5520	3	8	6	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 88
> Selected Move:	5430	3	10	8	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 98
> Selected Move:	5370	3	15	13	23500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  1  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 102
> Selected Move:	5500	3	6	19	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 113
> Selected Move:	5450	3	19	17	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 112
> Selected Move:	5440	3	8	19	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  1  1  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 113
> Selected Move:	5380	3	19	10	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  1  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 111
> Selected Move:	5440	3	17	8	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  1  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 109
> Selected Move:	5350	3	10	4	24500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  1  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 89
> Selected Move:	5340	3	8	19	24500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 98
> Selected Move:	5360	3	4	6	23500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  1  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 110
> Selected Move:	5310	3	19	17	23500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  1  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 106
> Selected Move:	5300	3	17	10	24000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  1  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 101
> Selected Move:	5280	3	6	4	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  1  1  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 84
> Selected Move:	5290	3	10	17	24500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 102
> Selected Move:	5310	3	13	15	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 91
> Selected Move:	5370	3	12	19	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 82
> Selected Move:	5580	3	4	9	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  1  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 111
> Selected Move:	5520	3	19	10	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 95
> Selected Move:	5430	3	10	8	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 102
> Selected Move:	5380	3	17	19	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 102
> Selected Move:	5370	3	9	17	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 105
> Selected Move:	5390	3	8	6	24000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 111
> Selected Move:	5350	3	6	2	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 106
> Selected Move:	5330	3	2	5	23500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 113
> Selected Move:	5300	3	17	12	24000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  1  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 102
> Selected Move:	5388	3	5	4	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 93
> Selected Move:	5270	3	4	16	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  1  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 114
> Selected Move:	5280	3	11	17	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 117
> Selected Move:	5270	3	17	8	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 110
> Selected Move:	5220	3	19	17	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 109
> Selected Move:	5220	3	8	10	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 106
> Selected Move:	5220	3	10	11	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  1  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 111
> Selected Move:	5250	3	16	5	24000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  1  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 103
> Selected Move:	5270	3	12	10	24000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 97
> Selected Move:	5330	3	5	6	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 97
> Selected Move:	5310	3	6	8	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 105
> Selected Move:	5325	3	10	2	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 104
> Selected Move:	5410	3	15	13	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 110
> Selected Move:	5370	3	2	9	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 111
> Selected Move:	5465	1	-1	19	28000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 113
> Selected Move:	5560	3	9	12	28000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  1  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 117
> Selected Move:	5510	3	12	5	27000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  1  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 121
> Selected Move:	5450	3	5	6	27500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  1  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 55 #######################


> Neighbours evaluated; 118
> Selected Move:	5498	3	13	12	27500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  1  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 56 #######################


> Neighbours evaluated; 118
> Selected Move:	5480	3	17	13	28000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  1  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 57 #######################


> Neighbours evaluated; 108
> Selected Move:	5415	3	19	17	28000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  1  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 58 #######################


> Neighbours evaluated; 108
> Selected Move:	5390	3	8	19	28000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  1  1  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 59 #######################


> Neighbours evaluated; 111
> Selected Move:	5310	3	13	15	29000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  1  1  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 60 #######################


> Neighbours evaluated; 100
> Selected Move:	5270	3	6	8	29000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  1  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 61 #######################


> Neighbours evaluated; 102
> Selected Move:	5370	2	15	-1	23000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 62 #######################


> Neighbours evaluated; 109
> Selected Move:	5340	1	-1	16	27000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  1  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 63 #######################


> Neighbours evaluated; 115
> Selected Move:	5318	3	11	13	27500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  1  1  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 64 #######################


> Neighbours evaluated; 106
> Selected Move:	5295	3	17	11	27500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  1  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 65 #######################


> Neighbours evaluated; 118
> Selected Move:	5250	3	12	17	27000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  0  1  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 66 #######################


> Neighbours evaluated; 108
> Selected Move:	5310	2	16	-1	23000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 67 #######################


> Neighbours evaluated; 103
> Selected Move:	5360	3	8	9	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 68 #######################


> Neighbours evaluated; 114
> Selected Move:	5320	3	17	8	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 69 #######################


> Neighbours evaluated; 107
> Selected Move:	5360	3	9	2	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  1  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 70 #######################


> Neighbours evaluated; 107
> Selected Move:	5330	3	13	17	24000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  1  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 71 #######################


> Neighbours evaluated; 105
> Selected Move:	5310	3	8	13	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 72 #######################


> Neighbours evaluated; 108
> Selected Move:	5250	3	2	3	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 73 #######################


> Neighbours evaluated; 106
> Selected Move:	5350	3	19	8	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 74 #######################


> Neighbours evaluated; 104
> Selected Move:	5300	3	17	19	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  1  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 75 #######################


> Neighbours evaluated; 105
> Selected Move:	5270	3	13	17	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  1  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 76 #######################


> Neighbours evaluated; 106
> Selected Move:	5290	3	3	9	23000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 77 #######################


> Neighbours evaluated; 105
> Selected Move:	5250	3	8	7	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  1  0  1  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 78 #######################


> Neighbours evaluated; 111
> Selected Move:	5330	3	9	12	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  0  1  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 79 #######################


> Neighbours evaluated; 115
> Selected Move:	5270	3	19	10	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  1  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 80 #######################


> Neighbours evaluated; 114
> Selected Move:	5310	3	7	8	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  1  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 81 #######################


> Neighbours evaluated; 108
> Selected Move:	5313	1	-1	13	28500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  1  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 82 #######################


> Neighbours evaluated; 116
> Selected Move:	5320	3	10	16	27500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  1  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 83 #######################


> Neighbours evaluated; 118
> Selected Move:	5273	3	16	5	27500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  1  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 84 #######################


> Neighbours evaluated; 113
> Selected Move:	5340	3	13	19	27000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  1  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 85 #######################


> Neighbours evaluated; 114
> Selected Move:	5348	3	17	13	27500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  1  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 86 #######################


> Neighbours evaluated; 109
> Selected Move:	5275	3	8	17	27500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  1  1  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 87 #######################


> Neighbours evaluated; 111
> Selected Move:	5233	3	5	16	27500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  1  1  1  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 88 #######################


> Neighbours evaluated; 110
> Selected Move:	5160	3	13	15	28500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  1  1  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 89 #######################


> Neighbours evaluated; 107
> Selected Move:	5173	3	16	5	28500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  1  1  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 90 #######################


> Neighbours evaluated; 99
> Selected Move:	5230	3	12	8	28000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  1  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 91 #######################


> Neighbours evaluated; 107
> Selected Move:	5205	3	15	16	26000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  1  0  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 92 #######################


> Neighbours evaluated; 115
> Selected Move:	5250	3	5	9	27000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  0  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 93 #######################


> Neighbours evaluated; 113
> Selected Move:	5228	3	11	13	27500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  0  0  1  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 94 #######################


> Neighbours evaluated; 100
> Selected Move:	5175	3	9	5	26500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  0  0  1  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 95 #######################


> Neighbours evaluated; 106
> Selected Move:	5108	3	19	11	26500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  1  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 96 #######################


> Neighbours evaluated; 119
> Selected Move:	5180	3	16	10	27500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  1  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 97 #######################


> Neighbours evaluated; 113
> Selected Move:	5250	2	5	-1	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 98 #######################


> Neighbours evaluated; 106
> Selected Move:	5300	3	8	9	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 99 #######################


> Neighbours evaluated; 108
> Selected Move:	5260	3	17	8	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  1  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 100 #######################


> Neighbours evaluated; 102
> Selected Move:	5320	3	13	15	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  1  1  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 101 #######################


> Neighbours evaluated; 99
> Selected Move:	5230	3	15	17	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  1  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 102 #######################


> Neighbours evaluated; 101
> Selected Move:	5270	3	9	2	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  1  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 103 #######################


> Neighbours evaluated; 96
> Selected Move:	5300	3	17	13	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  1  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 104 #######################


> Neighbours evaluated; 99
> Selected Move:	5250	3	8	17	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 105 #######################


> Neighbours evaluated; 108
> Selected Move:	5140	3	13	7	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  1  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 106 #######################


> Neighbours evaluated; 107
> Selected Move:	5200	3	10	19	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 107 #######################


> Neighbours evaluated; 110
> Selected Move:	5140	3	2	3	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 108 #######################


> Neighbours evaluated; 103
> Selected Move:	5150	3	7	15	26000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 109 #######################


> Neighbours evaluated; 104
> Selected Move:	5095	3	19	8	26000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 110 #######################


> Neighbours evaluated; 95
> Selected Move:	5240	3	3	6	24000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 111 #######################


> Neighbours evaluated; 104
> Selected Move:	5240	3	8	4	25000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 112 #######################


> Neighbours evaluated; 83
> Selected Move:	5280	3	6	9	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 113 #######################


> Neighbours evaluated; 86
> Selected Move:	5233	3	17	19	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 114 #######################


> Neighbours evaluated; 87
> Selected Move:	5190	3	9	6	25000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 115 #######################


> Neighbours evaluated; 88
> Selected Move:	5288	3	19	12	25500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 116 #######################


> Neighbours evaluated; 82
> Selected Move:	5265	3	6	8	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 117 #######################


> Neighbours evaluated; 94
> Selected Move:	5270	3	15	19	24000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 118 #######################


> Neighbours evaluated; 100
> Selected Move:	5290	3	4	6	23000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  1  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 119 #######################


> Neighbours evaluated; 104
> Selected Move:	5250	3	8	7	23500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  0  0  1  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 120 #######################


> Neighbours evaluated; 110
> Selected Move:	5230	3	6	4	24500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  0  1  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 121 #######################


> Neighbours evaluated; 101
> Selected Move:	5210	3	7	17	24000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 122 #######################


> Neighbours evaluated; 101
> Selected Move:	5230	3	4	6	23000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  1  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 123 #######################


> Neighbours evaluated; 104
> Selected Move:	5265	1	-1	7	28000


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  0  0  1  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 124 #######################


> Neighbours evaluated; 114
> Selected Move:	5200	3	6	8	28000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  1  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 125 #######################


> Neighbours evaluated; 116
> Selected Move:	5178	3	7	4	28500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  1  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 126 #######################


> Neighbours evaluated; 109
> Selected Move:	5220	2	19	-1	24000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  1  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 127 #######################


> Neighbours evaluated; 97
> Selected Move:	5240	3	4	6	23000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  1  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 128 #######################


> Neighbours evaluated; 100
> Selected Move:	5320	1	-1	10	28000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  1  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 129 #######################


> Neighbours evaluated; 116
> Selected Move:	5338	3	17	13	28500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  1  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 130 #######################


> Neighbours evaluated; 111
> Selected Move:	5260	3	8	17	28500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  1  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 131 #######################


> Neighbours evaluated; 109
> Selected Move:	5245	3	12	8	28000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 132 #######################


> Neighbours evaluated; 112
> Selected Move:	5285	3	6	9	28500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  1  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 133 #######################


> Neighbours evaluated; 109
> Selected Move:	5243	3	10	16	27500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 134 #######################


> Neighbours evaluated; 115
> Selected Move:	5180	3	17	19	27500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 135 #######################


> Neighbours evaluated; 116
> Selected Move:	5118	3	8	17	27500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  1  0  1  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 136 #######################


> Neighbours evaluated; 107
> Selected Move:	5045	3	9	5	26500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  1  0  1  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 137 #######################


> Neighbours evaluated; 112
> Selected Move:	5110	2	16	-1	22500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  1  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 138 #######################


> Neighbours evaluated; 110
> Selected Move:	5170	3	5	6	23000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 139 #######################


> Neighbours evaluated; 107
> Selected Move:	5180	3	19	8	23000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 140 #######################


> Neighbours evaluated; 100
> Selected Move:	5160	3	6	4	24000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 141 #######################


> Neighbours evaluated; 100
> Selected Move:	5220	3	13	15	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 142 #######################


> Neighbours evaluated; 91
> Selected Move:	5180	3	4	5	23500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 143 #######################


> Neighbours evaluated; 102
> Selected Move:	5180	3	8	4	24500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  0  0  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 144 #######################


> Neighbours evaluated; 89
> Selected Move:	5155	3	5	10	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  1  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 145 #######################


> Neighbours evaluated; 86
> Selected Move:	5195	3	17	12	26000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  1  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 146 #######################


> Neighbours evaluated; 80
> Selected Move:	5240	3	4	5	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 147 #######################


> Neighbours evaluated; 98
> Selected Move:	5210	3	5	16	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  1  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 148 #######################


> Neighbours evaluated; 110
> Selected Move:	5210	3	10	8	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 149 #######################


> Neighbours evaluated; 110
> Selected Move:	5210	3	11	10	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 150 #######################


> Neighbours evaluated; 104
> Selected Move:	5150	3	15	13	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 151 #######################


> Neighbours evaluated; 112
> Selected Move:	5210	3	10	19	23000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  1  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 152 #######################


> Neighbours evaluated; 111
> Selected Move:	5160	3	19	17	23000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  1  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 153 #######################


> Neighbours evaluated; 109
> Selected Move:	5225	1	-1	10	28000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  0  1  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 154 #######################


> Neighbours evaluated; 108
> Selected Move:	5230	3	13	11	27500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  1  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 155 #######################


> Neighbours evaluated; 121
> Selected Move:	5245	3	17	13	28000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  1  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 156 #######################


> Neighbours evaluated; 118
> Selected Move:	5200	3	16	5	28000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  1  1  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 157 #######################


> Neighbours evaluated; 117
> Selected Move:	5208	3	13	17	27500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  1  1  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 158 #######################


> Neighbours evaluated; 115
> Selected Move:	5245	3	5	15	29500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  1  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 159 #######################


> Neighbours evaluated; 107
> Selected Move:	5280	3	10	6	29000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  1  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 160 #######################


> Neighbours evaluated; 102
> Selected Move:	5310	3	17	19	29000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  1  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 161 #######################


> Neighbours evaluated; 102
> Selected Move:	5233	3	12	17	28500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  1  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 162 #######################


> Neighbours evaluated; 107
> Selected Move:	5270	3	6	9	29000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 163 #######################


> Neighbours evaluated; 103
> Selected Move:	5143	3	15	6	27500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  1  0  1  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 164 #######################


> Neighbours evaluated; 105
> Selected Move:	5120	3	6	7	28000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  1  0  1  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 165 #######################


> Neighbours evaluated; 108
> Selected Move:	5140	3	9	5	27000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  0  1  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 166 #######################


> Neighbours evaluated; 113
> Selected Move:	5115	3	8	12	27500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  1  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 167 #######################


> Neighbours evaluated; 113
> Selected Move:	5073	3	5	16	27500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  0  1  1  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 168 #######################


> Neighbours evaluated; 111
> Selected Move:	5000	3	11	8	27500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  1  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 169 #######################


> Neighbours evaluated; 107
> Selected Move:	5080	3	7	6	27000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  0  1  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 170 #######################


> Neighbours evaluated; 109
> Selected Move:	5080	2	6	-1	22500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  1  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 171 #######################


> Neighbours evaluated; 110
> Selected Move:	5080	3	12	15	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 172 #######################


> Neighbours evaluated; 110
> Selected Move:	5190	3	8	9	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 173 #######################


> Neighbours evaluated; 114
> Selected Move:	5130	3	19	8	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 174 #######################


> Neighbours evaluated; 103
> Selected Move:	5130	3	8	10	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 175 #######################


> Neighbours evaluated; 101
> Selected Move:	5130	3	10	11	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  1  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 176 #######################


> Neighbours evaluated; 112
> Selected Move:	5200	3	16	6	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  0  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 177 #######################


> Neighbours evaluated; 93
> Selected Move:	5150	3	17	19	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 178 #######################


> Neighbours evaluated; 91
> Selected Move:	5190	3	9	8	24000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 179 #######################


> Neighbours evaluated; 102
> Selected Move:	5263	3	6	2	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 180 #######################


> Neighbours evaluated; 106
> Selected Move:	5170	3	2	4	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 181 #######################


> Neighbours evaluated; 95
> Selected Move:	5130	3	4	5	23500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 182 #######################


> Neighbours evaluated; 104
> Selected Move:	5150	3	19	12	24000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 183 #######################


> Neighbours evaluated; 103
> Selected Move:	5150	3	8	4	25000


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  0  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 184 #######################


> Neighbours evaluated; 86
> Selected Move:	5130	3	12	19	24500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  0  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 185 #######################


> Neighbours evaluated; 91
> Selected Move:	5070	3	19	10	25000


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  0  1  1  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 186 #######################


> Neighbours evaluated; 80
> Selected Move:	5070	3	4	8	24000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  1  1  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 187 #######################


> Neighbours evaluated; 94
> Selected Move:	5130	3	5	6	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  1  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 188 #######################


> Neighbours evaluated; 97
> Selected Move:	5230	3	15	12	23500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  1  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 189 #######################


> Neighbours evaluated; 96
> Selected Move:	5210	3	6	4	24500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  1  1  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 190 #######################


> Neighbours evaluated; 97
> Selected Move:	5170	3	8	7	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  1  1  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 191 #######################


> Neighbours evaluated; 94
> Selected Move:	5190	3	4	6	24000


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  0  1  1  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 192 #######################


> Neighbours evaluated; 101
> Selected Move:	5200	3	10	17	23500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  0  0  1  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 193 #######################


> Neighbours evaluated; 105
> Selected Move:	5203	1	-1	10	28500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  0  1  1  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 194 #######################


> Neighbours evaluated; 112
> Selected Move:	5310	3	7	15	29500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  1  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 195 #######################


> Neighbours evaluated; 100
> Selected Move:	5233	3	17	8	29500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 196 #######################


> Neighbours evaluated; 105
> Selected Move:	5180	3	12	17	29000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 197 #######################


> Neighbours evaluated; 107
> Selected Move:	5278	3	6	9	29500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  1  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 198 #######################


> Neighbours evaluated; 106
> Selected Move:	5235	3	9	5	28500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  1  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 199 #######################


> Neighbours evaluated; 107
> Selected Move:	5198	3	10	12	28500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  1  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 200 #######################


> Neighbours evaluated; 99
> Selected Move:	5240	3	5	16	28500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 201 #######################


> Neighbours evaluated; 113
> Selected Move:	5283	3	11	19	28500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  1  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 202 #######################


> Neighbours evaluated; 104
> Selected Move:	5255	3	17	11	28500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 203 #######################


> Neighbours evaluated; 114
> Selected Move:	5178	3	16	5	28500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  1  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 204 #######################


> Neighbours evaluated; 103
> Selected Move:	5080	3	15	16	26500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  1  1  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265
________________________________________________________________

Best solution found: 5660
Run Termination time: 31.01.2010 11:57:40
Run duration: 00:04:25.0312500
________________________________________________________________
